The Fourier Discrepancy Function
نویسندگان
چکیده
منابع مشابه
Range of the Fractional Weak Discrepancy Function
In this paper we describe the range of values that can be taken by the fractional weak discrepancy of a poset and characterize semiorders in terms of these values. In [6], we defined the fractional weak discrepancy wdF (P ) of a poset P = (V,≺) to be the minimum nonnegative k for which there exists a function f : V → R satisfying (1) if a ≺ b then f(a) + 1 ≤ f(b) and (2) if a ‖ b then |f(a) − f...
متن کاملOn discrepancy bounds via dual shatter function∗
Recently, it has been shown that tight or almost tight upper bounds for the discrepancy of many geometrically defined set systems can be derived from simple combinatorial parameters of these set systems. Namely, if the primal shatter function of a set system R on an n-point set X is bounded by const.m, then disc(R) = O(n1/2−1/2d) (which is known to be tight), and if the dual shatter function is...
متن کاملOn the Discrepancy Function in Arbitrary Dimension, Close to L
Our subject is irregularities of distribution of points with respect to rectangles in the unit cube. It is a familiar theme of the subject is to show that no matter how N points are selected, they must be far from uniform. We give a new proof of a well-known theorem in the subject (Halász, 1981), concerning the L norm of the Discrepancy function, and show that this result admits an extension to...
متن کاملExponential Squared Integrability of the Discrepancy Function in Two Dimensions
Let AN be an N-point set in the unit square and consider the Discrepancy function DN(~x) ≔ ♯ ( AN ∩ [~0, ~x) ) −N|[~0, ~x)|, where ~x = (x1, x2) ∈ [0, 1], [0, ~x) = ∏2 t=1[0, xt), and |[~0, ~x)| denotes the Lebesgue measure of the rectangle. We give various refinements of a well-known result of (Schmidt, 1972) on the L∞ norm of DN. We show that necessarily ‖DN‖exp(Lα) & (logN)1−1/α , 2 ≤ α < ∞ ...
متن کاملBounds on the Fourier Coefficients of the Weighted Sum Function
We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an asymptotically “flat” Fourier spectrum and thus implies several lower bounds of its various complexity measures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Sciences
سال: 2023
ISSN: ['1539-6746', '1945-0796']
DOI: https://doi.org/10.4310/cms.2023.v21.n3.a2